Realizing partial orderings by classes of co-simple sets

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Realizing Sets by Hash Tables

ion We want to realize sets by tables, so we have to provide a homomorphism from tables to sets. This homomorphism is usually called an abstraction from tables to sets. Hence, we have to provide a function Abs : Tab !Set which constitutes this homomorphism, and axioms which state that Abs is indeed a homomorphism. (This idea goes back to [Hoa72]; its integration into algebraic methods for progr...

متن کامل

Realizing homology classes by symplectic submanifolds

In this note we prove that a positive multiple of each even-dimensional integral homology class of a compact symplectic manifold (M2n, ω) can be represented as the difference of the fundamental classes of two symplectic submanifolds in (M2n, ω). We also prove the realizability of some integral homology classes by symplectic submanifolds in (M2n, ω).

متن کامل

Fuzzy Orderings of Fuzzy Sets

The purpose of this paper is to introduce a general framework for comparing fuzzy sets with respect to fuzzy orderings in a gradual way. This approach is applicable to fuzzy subsets of any kind of universe for which a fuzzy ordering, no matter whether linear or not, is known.

متن کامل

On Realizing Homology Classes by Maps of Restricted Complexity

We show that in every codimension greater than one there exists a mod 2 homology class in some closed manifold (of sufficiently high dimension) which cannot be realized by an immersion of closed manifolds. The proof gives explicit obstructions (in terms of cohomology operations) for realizability of mod 2 homology classes by immersions. We also prove the corresponding result in which the word ‘...

متن کامل

Codes, orderings, and partial words

Codes play an important role in the study of the combinatorics of words. In this paper, we introduce pcodes that play a role in the study of combinatorics of partial words. Partial words are strings over a finite alphabet that may contain a number of “do not know” symbols. Pcodes are defined in terms of the compatibility relation that considers two strings over the same alphabet that are equal ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1978

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1978.76.169